منابع مشابه
Smoothing Loop Spaces
Using the theory of p-compact groups and surgery theory, we show that every quasifinite loop space is homotopy equivalent to a smooth manifold. 0. INTRODUCTION, STATEMENT OF RESULTS One of the motivating questions for surgery theory was whether all finite Hspaces are Lie groups up to homotopy equivalence. The question was answered in the negative by Hilton and Roitberg’s discovery of some H-spa...
متن کاملH∞ Fixed-Lag Smoothing for Descriptor Systems
In this paper, we study the finite horizon H∞ fixed-lag smoothing problem for linear descriptor systems. The key approach applied for deriving the H∞ fixed-lag smoother is the re-organization innovation analysis in Krein space. Under the Krein space, the H∞ fixed-lag smoothing is converted into an H2 estimation problem for the system with current and delayed measurements. By using innovation re...
متن کاملH∞ smoothing for continuous uncertain systems
Recently [1], a H∞ smoother has been developed and it gives good results for noise uncertainties. Nevertheless, when appear uncertain parameters, its performances decrease significantly. That’s why, in this paper, an estimator robust to noise uncertain properties and parameter uncertainties is presented. As in [1, 4, 6], the robust H∞ smoother for uncertain systems is developed as a combination...
متن کاملH-Projective Banach Spaces
and with the habitual changes in the case p = +∞. If I is a set then, l(I) denotes the Banach space L(I, ν),where ν is the counting measure. And if I is the set {1, ..., n}, the corresponding space is denoted ln . We will denote by H(X)the space of all analytic functions f : D −→ X such that ||f ||Hp(X) < +∞, with ||f ||Hp(X) = Sup {||fr||Lp(T;X) : 0 < r < 1} and fr(t) = f(rt), for all t ∈ T an...
متن کاملLandscape Smoothing of Numerical Permutation Spaces in Genetic Algorithms
The recent popularity of genetic algorithms (GA’s) and their application to a wide range of problems is a result of their ease of implementation and flexibility. Evolutionary techniques are often applied to optimization and related search problems where the fitness of a possible result is easily established. Although many landscapes are searched quickly, there are those, such as permutation lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1978
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-11774